On truth-table reducibility to SAT and the difference hierarchy over NP
نویسندگان
چکیده
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility via Boolean formulas to SAT and the same as log space Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. Finally, we show that the infinite difference hierarchy over NP is equal to ∆ p 2 and give an oracle oracle separating ∆ p 2 from the class of predicates polynomial time truth-table reducible to SAT.
منابع مشابه
Complexity-Restricted Advice Functions
We consider uniform subclasses of the nonuniform complexity classes de ned by Karp and Lipton via the notion of advice functions These subclasses are obtained by restricting the complexity of computing correct advice We also investigate the e ect of allowing advice functions of limited complexity to depend on the input rather than on the input s length Among other results using the notions desc...
متن کاملOn Truth-Table Reducibility to SAT
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which ∆p2 is not equal to...
متن کاملOn the difference between polynomial-time many-one and truth-table reducibilities on distributional problems
In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistNP under the hypothesis that P 6 = NP. As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT usin...
متن کاملA Note on P - selective sets and on Adaptive
We study two properties of a complexity class Cwhether there exists a truth-table hard p-selective language for C, and whether polynomially-many nonadaptive queries to C can be answered by making O(log n)-many adaptive queries to C (in symbols, is PF C tt PF C O(log n)]). We show that if there exists a NP-hard p-selective set under truth-table reductions, then PF NP tt PF NP O(log n)]. As a con...
متن کاملA Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP
We study two properties of a complexity class C—whether there exists a truthtable hard p-selective language for C , and whether polynomially-many nonadaptive queries to C can be answered by making O(logn)-many adaptive queries to C (in symbols, is PF tt PF [O(logn)]). We show that if there exists a NP-hard p-selective set under truth-table reductions, then PFNP tt PFNP[O(logn)]. As a consequenc...
متن کامل